Teaching Africa-Rooted Evaluation

4-PLACEMENT OF ROOTED TREES

A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.

Teaching Assessment & Evaluation

The Teaching Assessment and Evaluation Guide provides instructors with starting-points for reflecting on their teaching, and with advice on how to gather feedback on their teaching practices and effectiveness as part of a systematic program of teaching development. As well, the Guide provides guidance on how teaching might be fairly and effectively evaluated, which characteristics of teaching m...

Evaluation of Teaching

Teaching Engineering Wankat & Oreovicz It is natural to want to know how well one has done on a given task. In its simplest form, evaluation of teaching allows an instructor to obtain this feedback. Once collected, the data can be used to help the instructor improve the course, compare instructors, reward or punish the instructor, or inform potential students. Since improvement of teaching with...

Student Evaluation of Teaching

A characteristic polynomial for rooted graphs and rooted digraphs

We consider the one-variable characteristic polynomial p(G; ) in two settings. When G is a rooted digraph, we show that this polynomial essentially counts the number of sinks in G. When G is a rooted graph, we give combinatorial interpretations of several coe/cients and the degree of p(G; ). In particular, |p(G; 0)| is the number of acyclic orientations of G, while the degree of p(G; ) gives th...